/*
 * Test.cpp *
 *  Created on: Mar 27, 2010
 *      Author: yi
 */
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include "MarathonMatch58.h"

using namespace std;

int main(int argc, char** argv)
{
	freopen("input.in", "r", stdin);
	freopen("output.out", "w", stdout);
	IsolatedPrimes test;
//	int x, a, b;
//	while(cin >> x >> a >> b)
//	{
//		cout << x << ", " << a << ", " << b << endl;
//		cout << test.findPrime(x, a, b) << endl;
//		cout << test.count(23, 5, 5) << endl;
//		cout << test.isPrime(3) << endl;
//	}

	unsigned long long count= 0;
	for(unsigned long long i=3; i<=(unsigned long long) (1<<63)-1; i+=2)
	{
		if(test.isPrime(i))
		{
			count ++;
			cout << i << ", " << count << endl;
		}
	}
	return 0;
}
